Generating Multibillion Element Unstructured Meshes on Distributed Memory Parallel Machines

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Unstructured Nuclear Reactor Core Meshes in Parallel

Recent advances in supercomputers and parallel solver techniques have enabled users to run large simulations problems using millions of processors. Techniques for multiphysics nuclear reactor core simulations are under active development in several countries. Most of these techniques require large unstructured meshes that can be hard to generate in a standalone desktop computers because of high...

متن کامل

JOSTLE: Partitioning of Unstructured Meshes for Massively Parallel Machines

We outline the philosophy behind a newmethod for solving the graph-partitioning problem which arises in mapping unstructured mesh calculations to parallel computers. The method, encapsulated in a software tool, JOSTLE, employs a combination of techniques including the Greedy algorithm to give an initial partition, together with some powerful optimisation heuristics. A clustering technique is ad...

متن کامل

Parallel Partitioning of Unstructured Meshes

A method is outlined for optimising graph partitions which arise in mapping unstructured mesh calculations to parallel computers. The method employs a combination of iterative techniques to both evenly balance theworkload andminimise the number and volume of interprocessor communications. They are designed to work efficiently in parallel as well as sequentially and when combined with a fast dir...

متن کامل

Parallel Refinement of Unstructured Meshes

In this paper we describe a parallel h-refinement algorithm for unstructured finite element meshes based on the longest-edge bisection of triangles and tetrahedrons. This algorithm is implemented in PARED, a system that supports the parallel adaptive solution of PDEs. We discuss the design of such an algorithm for distributed memory machines including the problem of propagating refinement acros...

متن کامل

Scalability of Finite Element Applications on Distributed-memory Parallel Computers Scalability of Finite Element Applications on Distributed-memory Parallel Computers

This paper demonstrates that scalability and competitive eeciency can be achieved for unstructured grid nite element applications on distributed memory machines, such as the Connection Machine CM-5 system. The eeciency of nite element solvers is analyzed through two applications: an implicit computational aerodynamics application and an explicit solid mechanics application. Scalability of mesh ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific Programming

سال: 2015

ISSN: 1058-9244,1875-919X

DOI: 10.1155/2015/437480